A Matrix Decomposition Method for Optimal Normal Basis Multiplication
نویسندگان
چکیده
منابع مشابه
Toward an Optimal Algorithm for Matrix Multiplication
Ever since the dawn of the computer age, researchers have been trying to find an optimal way of multiplying matrices, a fundamental operation that is a bottleneck for many important algorithms. Faster matrix multiplication would give more efficient algorithms for many standard linear algebra problems, such as inverting matrices, solving systems of linear equations, and finding determinants. Eve...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملReducing the Complexity of Normal Basis Multiplication
In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF(2) expressed in a normal basis. The number of XOR gates for the proposed multiplication algorithm is fewer than that of the optimal normal basis multiplication, not taking into account the cost of forward and backward transformations. The algorithm is more suitable ...
متن کاملHypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
ÐIn this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph model. The proposed models reduce the decomposition problem to the well-known hypergraph partition...
متن کاملTheoretically optimal computing frontiers for rapid multiplication through decomposition
The productivity of the computation systems is determined to a high degree by the speed of multiplication, which is а basic element in multiple applications for digital signal processing, quantum computations, etc. The various approaches for design of asymptotically rapid algorithms for multiplication have developed in parallel with the evolution of the effective multiplicator architectures. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2016
ISSN: 0018-9340
DOI: 10.1109/tc.2016.2543228